Broadcasting in DMA-bound bounded degree graphs

AbstractBroadcasting is an information dissemination process in which a message is to be sent from a single originator to all members of a network by placing calls over the communication lines of the network. In [2], Bermond, Hell, Liestman and Peters studied the effect, on broadcasting capabilities, of placing an upper bound on the graph's degree. In this paper, we generalize their results allowing calls to involve more than two participants. We give lower bounds and construct bounded degree graphs which allow rapid broadcasting. Our constructions use the nation of compounding graphs in de Bruijin digraphs. We also obtain asymptotic upper and lower bounds for broadcast time, as the maximum degree increases

Design of teacher assistance tools in an exploratory learning environment for algebraic generalisation

The MiGen project is designing and developing an intelligent exploratory environment to support 11-14 year-old students in their learning of algebraic generalisation. Deployed within the classroom, the system also provides tools to assist teachers in monitoring students' activities and progress. This paper describes the architectural design of these Teacher Assistance tools and gives a detailed description of one such tool, focussing in particular on the research challenges faced, and the technologies and approaches chosen to implement the necessary functionalities given the context of the project

Locked and Unlocked Polygonal Chains in 3D

In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of segments in such a manner that both the length of each link and the simplicity of the chain are maintained throughout the movement. The analogous concept for closed chains is convexification: reconfiguration to a planar convex polygon. Chains that cannot be straightened or convexified are called locked. While there are open chains in 3D that are locked, we show that if an open chain has a simple orthogonal projection onto some plane, it can be straightened. For closed chains, we show that there are unknotted but locked closed chains, and we provide an algorithm for convexifying a planar simple polygon in 3D with a polynomial number of moves.Comment: To appear in Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, Jan. 199

Frobenius groups of automorphisms and their fixed points

Suppose that a finite group $G$ admits a Frobenius group of automorphisms $FH$ with kernel $F$ and complement $H$ such that the fixed-point subgroup of $F$ is trivial: $C_G(F)=1$. In this situation various properties of $G$ are shown to be close to the corresponding properties of $C_G(H)$. By using Clifford's theorem it is proved that the order $|G|$ is bounded in terms of $|H|$ and $|C_G(H)|$, the rank of $G$ is bounded in terms of $|H|$ and the rank of $C_G(H)$, and that $G$ is nilpotent if $C_G(H)$ is nilpotent. Lie ring methods are used for bounding the exponent and the nilpotency class of $G$ in the case of metacyclic $FH$. The exponent of $G$ is bounded in terms of $|FH|$ and the exponent of $C_G(H)$ by using Lazard's Lie algebra associated with the Jennings--Zassenhaus filtration and its connection with powerful subgroups. The nilpotency class of $G$ is bounded in terms of $|H|$ and the nilpotency class of $C_G(H)$ by considering Lie rings with a finite cyclic grading satisfying a certain `selective nilpotency' condition. The latter technique also yields similar results bounding the nilpotency class of Lie rings and algebras with a metacyclic Frobenius group of automorphisms, with corollaries for connected Lie groups and torsion-free locally nilpotent groups with such groups of automorphisms. Examples show that such nilpotency results are no longer true for non-metacyclic Frobenius groups of automorphisms.Comment: 31 page

Workspace and Singularity analysis of a Delta like family robot

Workspace and joint space analysis are essential steps in describing the task and designing the control loop of the robot, respectively. This paper presents the descriptive analysis of a family of delta-like parallel robots by using algebraic tools to induce an estimation about the complexity in representing the singularities in the workspace and the joint space. A Gr{\"o}bner based elimination is used to compute the singularities of the manipulator and a Cylindrical Algebraic Decomposition algorithm is used to study the workspace and the joint space. From these algebraic objects, we propose some certified three dimensional plotting describing the the shape of workspace and of the joint space which will help the engineers or researchers to decide the most suited configuration of the manipulator they should use for a given task. Also, the different parameters associated with the complexity of the serial and parallel singularities are tabulated, which further enhance the selection of the different configuration of the manipulator by comparing the complexity of the singularity equations.Comment: 4th IFTOMM International Symposium on Robotics and Mechatronics, Jun 2015, Poitiers, France. 201

Locked and Unlocked Polygonal Chains in Three Dimensions

This paper studies movements of polygonal chains in three dimensions whose links are not allowed to cross or change length. Our main result is an algorithmic proof that any simple closed chain that initially takes the form of a planar polygon can be made convex in three dimensions. Other results include an algorithm for straightening open chains having a simple orthogonal projection onto some plane, and an algorithm for making convex any open chain initially configured on the surface of a polytope. All our algorithms require only O (n) basic moves.

Aquaculture system diversity and sustainable development : fish farms and their representation

Initiatives for the sustainable development of aquaculture have so far focused on the production of codes of conduct, of best management practices, of standards etc., most of which have been developed by international organisations, the industrial sector and non governmental organisations. They were, to a large extent, produced using a "top down" process and inspired by models from intensive industrial shrimp and sea fish farming (mainly salmon). However, most of global aquaculture production comes from small-and medium-sized farms, essentially in Asia which contributes 92% of the total world aquaculture production volume. The objective of this article is to define the contours of systemic typologies that are able to express the sustainability conditions of aquaculture systems. The proposed approach builds on surveys of aquaculture systems which differ in terms of their biogeographical nature (temperate/tropical and north/south countries) or their farming techniques and their governance systems. This work is a prerequisite to any attempt at an individualised and comparative evaluation of specific aquaculture systems from either global or territorial viewpoints. In order to go beyond the cleavage of a typology based on the differentiation between developed and developing countries, three typologies were produced. These typologies allow for discriminatory variables to be identified such as for example the marketing methods or the pace of innovation: a structural typology, a functional typology and a systemic typology. Finally, the representations of aquaculture activity and of its sustainability that producers have of the 4 different types that emerge from the systemic typology were recorded and analyzed

Sharenting: Pride, affect and the day to day politics of digital mothering

The coming together of parenting and routine posting on social networking sites has become a visible and recognisable theme and the term ‘sharenting’ has found a place in everyday talk to describe some forms of parental digital sharing practices. However, while social media has undoubtedly provided a space for parents to share experiences and receive support around parenting, sharenting remains a contestable issue. Thus, one reading of sharenting would be as a display of good parenting as mothers ‘show off’ their children as a marker of success. However, the term also can be used pejoratively to describe parental oversharing of child-focused images and content. In this paper we explore the practice of sharenting in terms of pride, affect, and the politics of digital mothering in a neoliberal context to conclude that sharenting can be best understood as a complex affective and intersectional accomplishment that produces motherhood and family as communicative activities within digital social practices